منابع مشابه
Node-Capacitated Ring Routing
We consider the node-capacitated routing problem in an undirected ring network along with its fractional relaxation, the node-capacitated multicommodity flow problem. For the feasibility problem, Farkas’ lemma provides a characterization for general undirected graphs asserting roughly that there exists such a flow if and only if the so-called distance inequality holds for every choice of distan...
متن کاملCapacitated Node Routing Problems
This abstract describes a branch, cut, and price (BCP) algorithm for the solution of a class of network design problems with routing and packing constraints that can all be seen as special cases of a general model we will call the Capacitated Node Routing Problem (CNRP). We present several alternative integer programming formulation of the CNRP that can be shown to generalize a number of other ...
متن کاملAn Algorithm for Node-Capacitated Ring Routing
A strongly polynomial time algorithm is described to solve the node-capacitated routing problem in an undirected ring network.
متن کاملConnected Domatic Packings in Node-capacitated Graphs
A set of vertices in a graph is a dominating set if every vertex outside the set has a neighbor in the set. A dominating set is connected if the subgraph induced by its vertices is connected. The connected domatic partition problem asks for a partition of the nodes into connected dominating sets. The connected domatic number of a graph is the size of a largest connected domatic partition and it...
متن کاملA Scaling Algorithm for the Maximum Node-Capacitated Multiflow Problem
We study the problem of finding a fractional node-capacitated multiflow of maximum value in an undirected network. Previously known methods for this problem are based on linear programming and the ellipsoid method. In this paper we apply a capacity scaling approach and develop a purely combinatorial weakly polynomial algorithm of time complexity O(Λ(n, m, U) n log n log U), where n, m, U are th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Programming
سال: 2014
ISSN: 0025-5610,1436-4646
DOI: 10.1007/s10107-014-0810-0